0.08/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.08/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n021.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 07:16:39 EDT 2024 0.12/0.33 % CPUTime : 0.19/0.46 Running higher-order theorem proving 0.38/0.55 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p 0.39/0.71 # Version: 3.2.0-ho 0.39/0.71 # Preprocessing class: HSLSSMSMSSSNFFN. 0.39/0.71 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.39/0.71 # Starting sh3 with 900s (5) cores 0.39/0.71 # Starting lpo1_def_fix with 180s (1) cores 0.39/0.71 # Starting lpo8_s with 180s (1) cores 0.39/0.71 # Starting lpo1_lambda_fix with 180s (1) cores 0.39/0.71 # lpo1_def_fix with pid 29694 completed with status 0 0.39/0.71 # Result found by lpo1_def_fix 0.39/0.71 # Preprocessing class: HSLSSMSMSSSNFFN. 0.39/0.71 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.39/0.71 # Starting sh3 with 900s (5) cores 0.39/0.71 # Starting lpo1_def_fix with 180s (1) cores 0.39/0.71 # SinE strategy is gf600_gu_R05_F100_L20000 0.39/0.71 # Search class: HGHSM-FSLM31-DFFFFFNN 0.39/0.71 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.39/0.71 # Starting sh3 with 109s (1) cores 0.39/0.71 # sh3 with pid 29698 completed with status 0 0.39/0.71 # Result found by sh3 0.39/0.71 # Preprocessing class: HSLSSMSMSSSNFFN. 0.39/0.71 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.39/0.71 # Starting sh3 with 900s (5) cores 0.39/0.71 # Starting lpo1_def_fix with 180s (1) cores 0.39/0.71 # SinE strategy is gf600_gu_R05_F100_L20000 0.39/0.71 # Search class: HGHSM-FSLM31-DFFFFFNN 0.39/0.71 # Scheduled 5 strats onto 1 cores with 180 seconds (180 total) 0.39/0.71 # Starting sh3 with 109s (1) cores 0.39/0.71 # Preprocessing time : 0.012 s 0.39/0.71 # Presaturation interreduction done 0.39/0.71 0.39/0.71 # Proof found! 0.39/0.71 # SZS status Theorem 0.39/0.71 # SZS output start CNFRefutation 0.39/0.71 thf(decl_sort1, type, int: $tType). 0.39/0.71 thf(decl_sort2, type, nat: $tType). 0.39/0.71 thf(decl_25, type, one_one_int: int). 0.39/0.71 thf(decl_28, type, plus_plus_int: int > int > int). 0.39/0.71 thf(decl_31, type, times_times_int: int > int > int). 0.39/0.71 thf(decl_34, type, zero_zero_int: int). 0.39/0.71 thf(decl_39, type, bit0: int > int). 0.39/0.71 thf(decl_40, type, bit1: int > int). 0.39/0.71 thf(decl_42, type, pls: int). 0.39/0.71 thf(decl_43, type, number_number_of_int: int > int). 0.39/0.71 thf(decl_44, type, number_number_of_nat: int > nat). 0.39/0.71 thf(decl_46, type, ord_less_int: int > int > $o). 0.39/0.71 thf(decl_52, type, power_power_int: int > nat > int). 0.39/0.71 thf(decl_61, type, m: int). 0.39/0.71 thf(decl_63, type, s: int). 0.39/0.71 thf(decl_64, type, t: int). 0.39/0.71 thf(conj_0, conjecture, (ord_less_int @ (plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int) @ zero_zero_int), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', conj_0)). 0.39/0.71 thf(fact_92_zmult__1, axiom, ![X13:int]:(((times_times_int @ one_one_int @ X13)=(X13))), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_92_zmult__1)). 0.39/0.71 thf(fact_34_number__of__is__id, axiom, ![X5:int]:(((number_number_of_int @ X5)=(X5))), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_34_number__of__is__id)). 0.39/0.71 thf(fact_368_comm__semiring__1__class_Onormalizing__semiring__rules_I6_J, axiom, ![X400:int]:(((plus_plus_int @ X400 @ zero_zero_int)=(X400))), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_368_comm__semiring__1__class_Onormalizing__semiring__rules_I6_J)). 0.39/0.71 thf(fact_89_mult__Bit0, axiom, ![X5:int, X6:int]:(((times_times_int @ (bit0 @ X5) @ X6)=(bit0 @ (times_times_int @ X5 @ X6)))), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_89_mult__Bit0)). 0.39/0.71 thf(fact_253_semiring__norm_I110_J, axiom, ((one_one_int)=(number_number_of_int @ (bit1 @ pls))), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_253_semiring__norm_I110_J)). 0.39/0.71 thf(fact_232_add__Bit0__Bit1, axiom, ![X5:int, X6:int]:(((plus_plus_int @ (bit0 @ X5) @ (bit1 @ X6))=(bit1 @ (plus_plus_int @ X5 @ X6)))), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_232_add__Bit0__Bit1)). 0.39/0.71 thf(fact_170_Pls__def, axiom, ((pls)=(zero_zero_int)), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_170_Pls__def)). 0.39/0.71 thf(fact_328_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J, axiom, ![X113:int, X114:int]:(((plus_plus_int @ X113 @ X114)=(plus_plus_int @ X114 @ X113))), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_328_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J)). 0.39/0.71 thf(fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J, axiom, ![X700:int]:(((times_times_int @ X700 @ zero_zero_int)=(zero_zero_int))), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J)). 0.39/0.71 thf(fact_3_t, axiom, ((plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int)=(times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ t)), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_3_t)). 0.39/0.71 thf(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096, axiom, (ord_less_int @ (times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ t) @ (times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ zero_zero_int)), file('/export/starexec/sandbox2/tmp/tmp.2eU8Vjsorj/E---3.1_29615.p', fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096)). 0.39/0.71 thf(c_0_12, negated_conjecture, ~(ord_less_int @ (plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int) @ zero_zero_int), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.39/0.71 thf(c_0_13, plain, ![X2593:int]:(((times_times_int @ one_one_int @ X2593)=(X2593))), inference(variable_rename,[status(thm)],[fact_92_zmult__1])). 0.39/0.71 thf(c_0_14, plain, ![X3077:int]:(((number_number_of_int @ X3077)=(X3077))), inference(variable_rename,[status(thm)],[fact_34_number__of__is__id])). 0.39/0.71 thf(c_0_15, plain, ![X2376:int]:(((plus_plus_int @ X2376 @ zero_zero_int)=(X2376))), inference(variable_rename,[status(thm)],[fact_368_comm__semiring__1__class_Onormalizing__semiring__rules_I6_J])). 0.39/0.71 thf(c_0_16, negated_conjecture, ~(ord_less_int @ (plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int) @ zero_zero_int), inference(fof_nnf,[status(thm)],[c_0_12])). 0.39/0.71 thf(c_0_17, plain, ![X2792:int, X2793:int]:(((times_times_int @ (bit0 @ X2792) @ X2793)=(bit0 @ (times_times_int @ X2792 @ X2793)))), inference(variable_rename,[status(thm)],[fact_89_mult__Bit0])). 0.39/0.71 thf(c_0_18, plain, ![X5:int]:(((times_times_int @ one_one_int @ X5)=(X5))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.39/0.71 thf(c_0_19, plain, ((one_one_int)=(number_number_of_int @ (bit1 @ pls))), inference(split_conjunct,[status(thm)],[fact_253_semiring__norm_I110_J])). 0.39/0.71 thf(c_0_20, plain, ![X5:int]:(((number_number_of_int @ X5)=(X5))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.39/0.71 thf(c_0_21, plain, ![X2452:int, X2453:int]:(((plus_plus_int @ (bit0 @ X2452) @ (bit1 @ X2453))=(bit1 @ (plus_plus_int @ X2452 @ X2453)))), inference(variable_rename,[status(thm)],[fact_232_add__Bit0__Bit1])). 0.39/0.71 thf(c_0_22, plain, ![X5:int]:(((plus_plus_int @ X5 @ zero_zero_int)=(X5))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.39/0.71 thf(c_0_23, plain, ((pls)=(zero_zero_int)), inference(split_conjunct,[status(thm)],[fact_170_Pls__def])). 0.39/0.71 thf(c_0_24, plain, ![X2449:int, X2450:int]:(((plus_plus_int @ X2449 @ X2450)=(plus_plus_int @ X2450 @ X2449))), inference(variable_rename,[status(thm)],[fact_328_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J])). 0.39/0.71 thf(c_0_25, plain, ![X2408:int]:(((times_times_int @ X2408 @ zero_zero_int)=(zero_zero_int))), inference(variable_rename,[status(thm)],[fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J])). 0.39/0.71 thf(c_0_26, negated_conjecture, ~((ord_less_int @ (plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int) @ zero_zero_int)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.39/0.71 thf(c_0_27, plain, ((plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int)=(times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ t)), inference(split_conjunct,[status(thm)],[fact_3_t])). 0.39/0.71 thf(c_0_28, plain, ![X5:int, X6:int]:(((times_times_int @ (bit0 @ X5) @ X6)=(bit0 @ (times_times_int @ X5 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_17])). 0.39/0.71 thf(c_0_29, plain, ![X5:int]:(((times_times_int @ (bit1 @ pls) @ X5)=(X5))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19]), c_0_20])). 0.39/0.71 thf(c_0_30, plain, ![X5:int, X6:int]:(((plus_plus_int @ (bit0 @ X5) @ (bit1 @ X6))=(bit1 @ (plus_plus_int @ X5 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.39/0.71 thf(c_0_31, plain, ![X5:int]:(((plus_plus_int @ X5 @ pls)=(X5))), inference(rw,[status(thm)],[c_0_22, c_0_23])). 0.39/0.71 thf(c_0_32, plain, ![X6:int, X5:int]:(((plus_plus_int @ X5 @ X6)=(plus_plus_int @ X6 @ X5))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.39/0.71 thf(c_0_33, plain, ![X5:int]:(((times_times_int @ X5 @ zero_zero_int)=(zero_zero_int))), inference(split_conjunct,[status(thm)],[c_0_25])). 0.39/0.71 thf(c_0_34, negated_conjecture, ~((ord_less_int @ (plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int) @ pls)), inference(rw,[status(thm)],[c_0_26, c_0_23])). 0.39/0.71 thf(c_0_35, plain, (ord_less_int @ (times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ t) @ (times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ zero_zero_int)), inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096])). 0.39/0.71 thf(c_0_36, plain, ((times_times_int @ (bit1 @ (bit0 @ m)) @ t)=(plus_plus_int @ (bit1 @ pls) @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_20]), c_0_28]), c_0_28]), c_0_29]), c_0_19]), c_0_20]), c_0_30]), c_0_31]), c_0_32]), c_0_19]), c_0_20])). 0.39/0.71 thf(c_0_37, plain, ![X5:int]:(((times_times_int @ X5 @ pls)=(pls))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33, c_0_23]), c_0_23])). 0.39/0.71 thf(c_0_38, negated_conjecture, ~((ord_less_int @ (plus_plus_int @ (bit1 @ pls) @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls))))) @ pls)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_32]), c_0_19]), c_0_20])). 0.39/0.71 thf(c_0_39, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_20]), c_0_28]), c_0_28]), c_0_29]), c_0_19]), c_0_20]), c_0_30]), c_0_31]), c_0_36]), c_0_20]), c_0_28]), c_0_28]), c_0_29]), c_0_19]), c_0_20]), c_0_30]), c_0_31]), c_0_23]), c_0_37]), c_0_38]), ['proof']). 0.39/0.71 # SZS output end CNFRefutation 0.39/0.71 # Parsed axioms : 745 0.39/0.71 # Removed by relevancy pruning/SinE : 50 0.39/0.71 # Initial clauses : 927 0.39/0.71 # Removed in clause preprocessing : 22 0.39/0.71 # Initial clauses in saturation : 905 0.39/0.71 # Processed clauses : 915 0.39/0.71 # ...of these trivial : 129 0.39/0.71 # ...subsumed : 138 0.39/0.71 # ...remaining for further processing : 647 0.39/0.71 # Other redundant clauses eliminated : 85 0.39/0.71 # Clauses deleted for lack of memory : 0 0.39/0.71 # Backward-subsumed : 8 0.39/0.71 # Backward-rewritten : 41 0.39/0.71 # Generated clauses : 68 0.39/0.71 # ...of the previous two non-redundant : 62 0.39/0.71 # ...aggressively subsumed : 0 0.39/0.71 # Contextual simplify-reflections : 2 0.39/0.71 # Paramodulations : 0 0.39/0.71 # Factorizations : 0 0.39/0.71 # NegExts : 0 0.39/0.71 # Equation resolutions : 85 0.39/0.71 # Disequality decompositions : 0 0.39/0.71 # Total rewrite steps : 1397 0.39/0.71 # ...of those cached : 1226 0.39/0.71 # Propositional unsat checks : 0 0.39/0.71 # Propositional check models : 0 0.39/0.71 # Propositional check unsatisfiable : 0 0.39/0.71 # Propositional clauses : 0 0.39/0.71 # Propositional clauses after purity: 0 0.39/0.71 # Propositional unsat core size : 0 0.39/0.71 # Propositional preprocessing time : 0.000 0.39/0.71 # Propositional encoding time : 0.000 0.39/0.71 # Propositional solver time : 0.000 0.39/0.71 # Success case prop preproc time : 0.000 0.39/0.71 # Success case prop encoding time : 0.000 0.39/0.71 # Success case prop solver time : 0.000 0.39/0.71 # Current number of processed clauses : 530 0.39/0.71 # Positive orientable unit clauses : 147 0.39/0.71 # Positive unorientable unit clauses: 28 0.39/0.71 # Negative unit clauses : 18 0.39/0.71 # Non-unit-clauses : 337 0.39/0.71 # Current number of unprocessed clauses: 52 0.39/0.71 # ...number of literals in the above : 98 0.39/0.71 # Current number of archived formulas : 0 0.39/0.71 # Current number of archived clauses : 49 0.39/0.71 # Clause-clause subsumption calls (NU) : 30055 0.39/0.71 # Rec. Clause-clause subsumption calls : 18244 0.39/0.71 # Non-unit clause-clause subsumptions : 99 0.39/0.71 # Unit Clause-clause subsumption calls : 501 0.39/0.71 # Rewrite failures with RHS unbound : 0 0.39/0.71 # BW rewrite match attempts : 252 0.39/0.71 # BW rewrite match successes : 156 0.39/0.71 # Condensation attempts : 0 0.39/0.71 # Condensation successes : 0 0.39/0.71 # Termbank termtop insertions : 72645 0.39/0.71 # Search garbage collected termcells : 13373 0.39/0.71 0.39/0.71 # ------------------------------------------------- 0.39/0.71 # User time : 0.113 s 0.39/0.71 # System time : 0.011 s 0.39/0.71 # Total time : 0.125 s 0.39/0.71 # Maximum resident set size: 5984 pages 0.39/0.71 0.39/0.71 # ------------------------------------------------- 0.39/0.71 # User time : 0.136 s 0.39/0.71 # System time : 0.016 s 0.39/0.71 # Total time : 0.152 s 0.39/0.71 # Maximum resident set size: 2980 pages 0.39/0.71 % E---3.1 exiting 0.39/0.71 % E exiting 0.39/0.71 EOF